منابع مشابه
Minimum-link watchman tours
We consider the problem of computing a watchman route in a polygon with holes. We show that the problem of finding a minimum-link watchman route is NP-complete, even if the holes are all convex. The proof is based on showing that the related problem of finding a minimum-link tour on a set of points in the plane is NP-complete. We provide a provably good approximation algorithm that achieves an ...
متن کاملFigurative Tours and Braids
We start with a rectangular grid of points, and we connect pairs of points to form either a tour (a Hamiltonian cycle) or a braid (a collection of disjoint paths that start in the top row and end on the bottom). In each case, our goal is to design a graph that will closely resemble a grayscale target image when viewed from a distance. From up close, the graph will look like an abstract pattern....
متن کاملGood triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give several motivations for considering this heuristic, along with extensive computational results. It turns out that the Delaunay and greedy tria...
متن کاملVirtual tours for museum exhibits
This paper outlines the technological requirements and the steps necessary to create a virtual tour for a virtual museum exhibit using QR Codes. This system was developed for the Gilcrease Museum in Tulsa, Oklahoma and was tested in two separate exhibits. The components of virtualization include: images of each object for visualization; object labels and metadata about the objects in the exhibi...
متن کاملGeneralised Knight's Tours
The problem of existence of closed knight’s tours in [n]d, where [n] = {0, 1, 2, . . . , n− 1}, was recently solved by Erde, Golénia, and Golénia. They raised the same question for a generalised, (a, b) knight, which is allowed to move along any two axes of [n]d by a and b unit lengths respectively. Given an even number a, we show that the [n]d grid admits an (a, 1) knight’s tour for sufficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1987
ISSN: 0028-0836,1476-4687
DOI: 10.1038/326554b0